Possibilistic Aggregations in the Discrete Covering Problem: Application in the Problem of Optimal Choice of Alternatives
نویسندگان
چکیده
In this paper a new criterion is introduced for the discrete covering problem. In this criterion the a priori information represented by a possibility measure and a misbelief distribution on alternatives are condensed by aggregation instruments. Using the Dempster-Shafer belief structure and representations of a possibility measure through associated probabilities, a new criterion for discrete covering problem is constructed based on aggregation by the Most Typical Value (MTV), namely, Monotone Expectation (ME) (or Choquet integral). A bicriterial problem is obtained using a new criterion and the criterion of average price minimization. The example on the application of a new criterion is presented, where the possibility distribution on the optimal choice of the candidates (alternatives) is represented by expert valuations. Key–Words: Minimal fuzzy covering, possibility measure, associated probabilities, average misbelief criterion, MTV, ME, Dempster–Shafer belief structure
منابع مشابه
Bi-objective Optimization of a Multi-product multi-period Fuzzy Possibilistic Capacitated Hub Covering Problem: NSGA-II and NRGA Solutions
The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...
متن کاملANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY
This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system a...
متن کاملOn Rank-Ordered Nested Multinomial Logit Model and D-Optimal Design for this Model
In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملA multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کامل